A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

In this paper, we analyze a discrete-time GI-G1, Geo2-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. The high-priority class contains packets with generally distributed service times while the low-priority packets are assumed to have geometrically distributed service times. We show that the use of generating functions is beneficial for analyzing the system contents and packet delay of both classes. Performance measures of system contents and packet delay are calculated. We apply these theoretical results on the special case of a packet switch.